Embeddings in $G(1,\,3)$
نویسندگان
چکیده
منابع مشابه
Labeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملLattice Embeddings in Percolation
Does there exist a Lipschitz injection of Z into the open set of a site percolation process on Z, if the percolation parameter p is sufficiently close to 1? We prove a negative answer when d = D, and also when d ≥ 2 if the Lipschitz constant M is required to be 1. Earlier work of Dirr, Dondl, Grimmett, Holroyd, and Scheutzow yields a positive answer for d < D and M = 2. As a result, the above q...
متن کاملEmbeddings in Generalized Manifolds
We prove that a (2m n+1)-connectedmap f : Mm ! Xn from a compact PL m-manifoldM to a generalized n-manifoldX with the disjoint disks property, 3m 2n 2, is homotopic to a tame embedding. There is also a controlled version of this result, as well as a version for noncompactM and proper maps f that are properly (2m n+ 1)-connected. The techniques developed lead to a general position result for arb...
متن کاملPartial Knowledge in Embeddings
Representing domain knowledge is crucial for any task. There has been a wide range of techniques developed to represent this knowledge, from older logic based approaches to the more recent deep learning based techniques (i.e. embeddings). In this paper, we discuss some of these methods, focusing on the representational expressiveness tradeoffs that are often made. In particular, we focus on the...
متن کاملEmbeddings in Hypercubes
One important aspect of efficient use of a hypercube computer to solve a given problem is the assignment of subtasks to processors in such a way that the communication overhead is low. The subtasks and their inter-communication requirements can be modeled by a graph, and the assignment of subtasks to processors viewed as an embedding of the task graph into the graph of the hypercube network. We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1983
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1983-0718977-3